#include <iostream>
#include <cstdio>
#include <malloc.h>
#define LIST_INIT_SIZE 100
#define LISTINCREASEMEMT 10
typedef struct Node
{
	ElemType data;     
	struct Node *next; 
}Node,*LinkList;
LinkList p, q, flag;
void insert(LinkList L,int n, int insertData){
    p = L->next;
    q = (LinkList)malloc(sizeof(Node));
    flag = (LinkList)malloc(sizeof(Node));
    for (int i = 0; i < n; i++)
    {
        if (p->data<x&&i!=n )
        {
            flag = p;
            p = p->next;
        }
        else if (i == n)
        {
            flag->next = q;
            q->next = NULL;
        }
        else
        {
           q->next = flag->next;
           flag->next = q;

        }
        
        
        
    }
    
}